Restricting Query Relaxation through User Constraints

نویسنده

  • Terry Gaasterland
چکیده

This paper describes techniques to restrict and to heuristically control relaxation of deductive database queries. The process of query relaxation provides a user with a means to automatically identify new queries that are related to the user's original query. However, for large databases, many relaxations may be possible. The methods to control and restrict the relaxation process introduced in this paper focus the relaxation process and make it more eecient. User restrictions over the database domain may be expressed as user constraints. This paper describes how user constraints can restrict relaxed queries. Also, a set of heuristics based on cooperative answering techniques are presented for controlling the relaxation process. Finally, the interaction of the methods for relaxing queries, processing user constraints, and applying the heuristic rules is described.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relaxation as a Platform of Cooperative Answering

1. Introduction Users may not always ask queries that obtain the information they desire. A user might need more information than requested, or a user might actually need diierent information. However, it is likely that the query is closely related to the user's intent. Thus, a method to search for answers which are in the neighborhood of the user's original query could be used to produce respo...

متن کامل

Cooperative Answering through Controlled Query Relaxation

AS KNOWLEDGE STORAGE SYStems grow in size and complexity, it becomes unreasonable to expect that users always know enough about the data and how the data are organized to construct accurate and useful queries. Even when a system has syntactic utilities for building queries, users continue to compose queries that contain misconceptions, are too general, or are bound to fail. Cooperative-answerin...

متن کامل

Query-oriented Relaxation for Cardinality Assurance

Although a large number of queries used in applications ranging from web search to business intelligence have associated cardinality constraints, current database engines have minimal support for ensuring query cardinality. This leads to two main types of problems: the empty result-set problems and the too few/too many problems. Inability to meet query cardinality constraints requires the user ...

متن کامل

Cooperative Query Rewriting for Decision Making Support and Recommender Systems

& This article presents a new technology called interactive query management (IQM), designed for supporting flexible query management in decision support systems and recommender systems. IQM aims at guiding a user to refine a query to a structured repository of items when it fails to return a manageable set of products. Two failure conditions are considered here, when a query returns either too...

متن کامل

Constraint relaxation of the polygon-polyline topological relation for geographic pictorial query languages

This work addresses the problem of relaxing spatial constraints for pictorial queries having null answers in geographical databases. It focuses on the polygon-polyline topological relationship and proposes a computational model which is based on the notions of Operator Conceptual Neighborhood (OCN) graph and the relative 16-intersection matrix. The former is addressed to represent the conceptua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993